representation of the physical layout. The algor i thm works on a set o f configurations constituting a constant size population. The transformations are performed through crossover operators that generate a new configuration assimilating the characteristics o f a pair o f configurations existing in the current population (similar to biological reproduction). Muta t ion and inversion operators ...

This document presents the implementation and the per formance evaluation of several algor ithms proposed for the detection of QRS complexes. Also, the optimization of the algor ithms is made maximizing the per formance measures of sensitivity and precision. An special emphasis is made for an hybr id algor ithm based on linear filter ing, Hilber t tr ans...

In th is paper we present an algor i thm for f inding a "c losed-form" solut ion of the dil l-erential equatiofl -1"'+ ql +by, where a and b are rational functions of a complex var iable .x. provided a "c losed-form" solut ion exists. The algor i thm is so arranged that i f no solut icrn is found. then no solut ion can exist . The frrst sect ion makes precise what is meant by "c losed-form" and...

This paper describes a constrained bin-packing •problem (CBPP) and an approximate, anytime algor i thm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algor i thm for CBPP uses a heuristic search for labeling edges w i th a binary val...

A new evolut ionary method for the global optimizat ion of fun ctions wit h cont inuous vari ab les is proposed . This algorit hm can be viewed as an efficient par allelization of the simula ted annealing technique , although a suitable interval coding shows a close ana logy between real-coded genet ic algorit hms and the pr oposed meth od , called int erval genetic algorithm . Some well-define...

Massively parallel compute rs afford to genetic algorithms t he use of very large populat ions, which allow t he algor it hms to at tack more difficult optimization prob lems than were feasible in t he past . Optimization perform an ce on difficult search spacesthose t hat are both vast and have large num bers of local optima-can be particularly crippled by a common problem of genet ic algor it...

By studying the problem-solving techniques that people use to design algor i thms we can learn something about bui ld ing systems that automatical ly derive algor i thms or assist human designers. In this paper we present a model of a lgor i thm design based on our analysis of the protocols of two subjects designing three convex hull algori thms. The subjects work mainly in a data-f low problem...

Abs t rac t At the heart of many optimizat ion procedures are powerful pruning and propagation rules. This paper presents a case study in the construction of such rules. We develop a new algor i thm, Complete Decreasing Best F i t , that finds the opt imal packing of objects into bins. The algor i thm use a branching rule based on the well known Decreasing Best Fi t approximat ion algor i thm. ...